Spatial Mixing of Coloring Random Graphs
نویسنده
چکیده
We study the strong spatial mixing (decay of correlation) property of proper q-colorings of random graphG(n, d/n) with a fixed d. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as G(n, d/n), an easy counterexample shows that colorings do not exhibit strong spatial mixing with high probability. Nevertheless, we show that for q ≥ αd+ β with α > 2 and sufficiently large β = O(1), with high probability proper qcolorings of random graph G(n, d/n) exhibit strong spatial mixing with respect to an arbitrarily fixed vertex. This is the first strong spatial mixing result for colorings of graphs with unbounded maximum degree. Our analysis of strong spatial mixing establishes a block-wise correlation decay instead of the standard point-wise decay, which may be of interest by itself, especially for graphs with unbounded degree.
منابع مشابه
Strong spatial mixing for list coloring of graphs
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise known to be #P hard. In the context of coloring, strong spatial mixing has been established for regular trees in [GS11] when q ≥ α∗∆+ 1 where q the number o...
متن کاملSpatial mixing and approximate counting for Potts model on graphs with bounded average degree
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs characterized by a specific contraction function, the model exhibits strong spatial mixing, and if further the graphs exhibit certain local sparsity which are very n...
متن کاملSampling colorings almost uniformly in sparse random graphs
The problem of sampling proper q-colorings from uniform distribution has been extensively studied. Most of existing samplers require q ≥ α∆+ β for some constants α and β, where ∆ is the maximum degree of the graph. The problem becomes more challenging when the underlying graph has unbounded degree since even the decision of q-colorability becomes nontrivial in this situation. The Erdős-Rényi ra...
متن کاملGibbs Rapidly Samples Colorings of G(n, d/n)
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sampling on the Erdős-Rényi random graph G(n, d/n), where each edge is chosen independently with probability d/n and d is fixed. While the average degree in G(n, d/n) is d(1 − o(1)), it contains many nodes of degree of o...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کامل